Efficient Computation of the State Equation for Sparse Adjacency Matrices in Max-Plus Algebraic Systems
نویسنده
چکیده
This research proposes a useful framework for efficiently computing the state equations in scheduling problems for a class of discrete event systems. We focus on systems in which the precedence relationships are represented by a sparse adjacency matrix. The state equations are linear ones in max-plus algebra, and give the earliest event occurrence times. Even if we use the most efficient algorithm proposed thus far, the time complexity for computing the state equations is O(n^2), where n represents the number of nodes. Moreover, the values of the adjacency matrix have to be given by a full matrix, which is inefficient in terms of both time and space. Our proposed framework adopts a compressed matrix format, the use of which reduces the time complexity for the computation to O(n+m), where m represents the number of arcs. Thus, the framework is especially beneficial if the adjacency matrix is sparse.
منابع مشابه
A Fast Computation for the State Vector in a Max-Plus Algebraic System with an Adjacency Matrix of a Directed Acyclic Graph
We provide a useful method for calculating the state vector of a state equation efficiently in a max-plus algebraic system. For a discrete event system whose precedence relationships are represented by a directed acyclic graph, computing the transition matrix, which includes the Kleene star operation of a weighted adjacency matrix, is occasionally the bottleneck. On the other hand, the common o...
متن کاملA linear algebraic approach to datalog evaluation
In this paper, we propose a fundamentally new approach to Datalog evaluation. Given a linear Datalog program DB written using N constants and binary predicates, we first translate if-and-only-if completions of clauses in DB into a set Eq(DB) of matrix equations with a non-linear operation where relations in MDB, the least Herbrand model of DB, are encoded as adjacency matrices. We then translat...
متن کاملMax-plus algebra and its application in spreading of information
In this paper circulant matrices in max-plus algebra are presented. Circulant matrices are special form of matrices which are entered by vector of inputs. For special types of matrices such as circulant matrices, the computation can often be performed in the simpler way than in the general case. The so-called max-plus algebra is useful for investigation of discrete events systems and the sequen...
متن کاملHigh-Speed Computation of the Kleene Star in Max-Plus Algebra Using a Cell Broadband Engine
This research addresses a high-speed computation method for the Kleene Star of the weighted adjacency matrix in max-plus algebraic system. We focus on systems whose precedence constraints are represented by a directed acyclic graph (DAG), and implement on a Cell Broadband EngineTM (CBE) processor. Using the implementation on a Sony Playstation3TM (PS3) equipped with a CBE processor, we attempt ...
متن کاملEfficient Computation of the Kleene Star in Max-Plus Algebra using a CUDA GPU
This research aims to accelerate the computation of the Kleene star in max-plus algebra using CUDA technology on graphics processing units (GPUs). The target module is the Kleene star of a weighted adjacency matrix for directed acyclic graph (DAGs) which plays an essential role in calculating the earliest and/or latest schedule for a class of discrete event systems. In recent NVIDIA GPU cards, ...
متن کامل